Compiling Nondeterministic Computations Pem
ثبت نشده
چکیده
Implementing a compiler for such a language with nonde-terministic features is known to be a diicult task. This paper presents two new functions setChoicePoint and fail that extend the C language to eeciently handle choice point management. Algorithms and implementation techniques are detailed. As an application, we give compilation schemes to illustrate the power and the easy use of setChoicePoint and fail to design new compilation schemes for nondeterministic computation in the system ELAN.
منابع مشابه
Linear Logic Automata
A Linear Logic automaton is a hybrid of a finite automaton and a non-deterministic Petri net. LL automata commands are represented by propositional Horn Linear Logic formulas. Computations performed by LL automata directly correspond to cut-free derivations in Linear Logic. A programming language of LL automata is developed in which typical sequential, nondeterministic and parallel programming ...
متن کاملOn the pair-electromagnetic pulse from an electromagnetic black hole surrounded by a baryonic remnant
The interaction of an expanding PairElectromagnetic pulse (PEM pulse) with a shell of baryonic matter surrounding a Black Hole with electromagnetic structure (EMBH) is analyzed for selected values of the baryonic mass at selected distances well outside the dyadosphere of an EMBH. The dyadosphere, the region in which a super critical field exists for the creation of e+e− pairs, is here considere...
متن کاملQuantifying Nondeterminism in Finite Automata
Various ways of quantifying the nondeterminism in finite automata have been considered since the 1970’s. Roughly speaking, a nondeterminism measure can count the number of accepting computations (ambiguity), the number of all computations (computation width) or the amount of nondeterminism on a single best (or worst) computation on a given input. This paper surveys results on the growth rate of...
متن کاملPolynomial-Time Reformulations of LTL Temporally Extended Goals into Final-State Goals
Linear temporal logic (LTL) is an expressive language that allows specifying temporally extended goals and preferences. A general approach to dealing with general LTL properties in planning is by “compiling them away”; i.e., in a pre-processing phase, all LTL formulas are converted into simple, non-temporal formulas that can be evaluated in a planning state. This is accomplished by first genera...
متن کاملCompiling Simple Context Restrictions with Nondeterministic Automata
This paper describes a non-conventional method for compiling (phonological or morpho-syntactic) context restriction (CR) constraints into non-deterministic automata in finite-state tools and surface parsing systems. The method reduces any CR into a simple one that constraints the occurrences of the empty string and represents right contexts with co-determististic states. In cases where a fully ...
متن کامل